Rationality problem for norm one tori
نویسندگان
چکیده
We classify stably/retract rational norm one tori in dimension $p-1$ where $p$ is a prime number and up to ten with some minor exceptions.
منابع مشابه
Incompressibility of Generic Torsors of Norm Tori
Let p be a prime integer, F a field of characteristic not p, T the norm torus of a degree p extension field of F , and E a T -torsor over F such that the degree of each closed point on E is divisible by p (a generic T -torsor has this property). We prove that E is p-incompressible. Moreover, all smooth compactifications of E (including those given by toric varieties) are p-incompressible. The m...
متن کاملThe edge-isoperimetric problem for discrete tori
The edge-isoperimetric problem has long been solved for cartesian powers of the cycles C3 and C4, for which the lexicographic order is the optimal order, and powers of the cycles Cn with n¿ 5, which do not have nested optimal subsets. For powers of C5, it is clear that the lexicographic order is not optimal. We present a solution to the edge-isoperimetric problem for powers of C5 in the form of...
متن کاملOne-to-one disjoint path covers on multi-dimensional tori
One-to-one disjoint path covers on multi-dimensional tori Jing Li, Di Liu, Yuxing Yang & Jun Yuan a School of Applied Science, Taiyuan University of Science and Technology, Taiyuan 030024, China b School of Mathematical Sciences, Shanxi University, Taiyuan 030006, China c College of Mathematics and Information Science, Henan Normal University, XinXiang 453007, China Accepted author version post...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2021
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-021-2117-1